Short Certificates for Tournaments
نویسندگان
چکیده
An isomorphism certificate of a labeled tournament T is a labeled subdigraph of T which together with an unlabeled copy of T allows the errorless reconstruction of T . It is shown that any tournament on n vertices contains an isomorphism certificate with at most n log2 n edges. This answers a question of Fishburn, Kim and Tetali. A score certificate of T is a labeled subdigraph of T which together with the score sequence of T allows its errorless reconstruction. It is shown that there is an absolute constant > 0 so that any tournament on n vertices contains a score certificate with at most (1/2− )n edges.
منابع مشابه
Short Score Certificates for Upset Tournaments
A score certificate for a tournament, T , is a collection of arcs of T which can be uniquely completed to a tournament with the same scorelist as T ’s, and the score certificate number of T is the least number of arcs in a score certificate of T . Upper bounds on the score certificate number of upset tournaments are derived. The upset tournaments on n vertices are in one–to–one correspondence w...
متن کاملTournaments for Ideas
Governments and foundations have successfully harnessed tournaments to spur innovation. Yet this tool is not widely used by firms. We offer a framework for managers seeking to organize tournaments for ideas. We present the theoretical underpinnings of tournaments. We then connect the theory with three recent innovations—the power of the network, the wisdom of crowds, and the power of love—that ...
متن کاملt-Pancyclic Arcs in Tournaments
Let $T$ be a non-trivial tournament. An arc is emph{$t$-pancyclic} in $T$, if it is contained in a cycle of length $ell$ for every $tleq ell leq |V(T)|$. Let $p^t(T)$ denote the number of $t$-pancyclic arcs in $T$ and $h^t(T)$ the maximum number of $t$-pancyclic arcs contained in the same Hamiltonian cycle of $T$. Moon ({em J. Combin. Inform. System Sci.}, {bf 19} (1994), 207-214) showed that $...
متن کاملA Further Step Towards an Understanding of the Tournament Equilibrium Set
We study some problems pertaining to the tournament equilibrium set (τ for short). A tournament H is a τ-retentive tournament if there is a tournament T which has a minimal τ-retentive set R such that T [R] is isomorphic to H. We study τ-retentive tournaments and achieve many significant results. In particular, we prove that there are no τretentive tournaments of size 4, only 2 non-isomorphic τ...
متن کاملHow (not) to Incent Crowd Workers
Crowdsourcing gains momentum: In digital work places such as Amazon Mechanical Turk, oDesk, Clickworker, 99designs, or InnoCentive it is easy to distribute human work to hundreds or thousands of freelancers. In these crowdsourcing settings, one challenge is to properly incent worker effort to create value. Common incentive schemes are piece rate payments and rankorder tournaments among workers....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 4 شماره
صفحات -
تاریخ انتشار 1997